Randomized algorithms - PDFSEARCH.IO - Document Search Engine

Randomized algorithms
Results: 419

#	Item
121	Randomized Algorithms 2015A Lecture 5 – Edge Sparsification for Cuts∗ Robert Krauthgamer 1 Add to Reading List Source URL: www.wisdom.weizmann.ac.il Language: English - Date: 2014-12-03 01:22:41 Graph connectivity Combinatorial optimization Graph coloring Connectivity Induced path K-edge-connected graph Matching Cut Graph Graph theory Mathematics Theoretical computer science
122	doi:j.amc Add to Reading List Source URL: pdos.csail.mit.edu Language: English - Date: 2007-06-26 11:07:50 Probabilistic complexity theory Video game development Mathematical logic Theoretical computer science Randomized algorithm Computer science Video game bot Medical algorithm Mathematics Applied mathematics Algorithms
123	Randomized Algorithms 2013A – Problem Set 5 Robert Krauthgamer and Moni Naor Date Due: February 13 Read Haeupler’s paper [Hae11] and use it to answer the following questions in a self-contained manner. You are suppos Add to Reading List Source URL: www.wisdom.weizmann.ac.il Language: English - Date: 2013-01-28 13:36:00 Network performance Wireless sensor network Information Telecommunications engineering Mathematics Coding theory Information theory Network coding
124	arXiv:0909.2005v1 [cs.DS] 10 SepDeterministic approximation for the cover time of trees Uriel Feige∗ Add to Reading List Source URL: arxiv.org Language: English - Date: 2009-09-10 14:01:15 Analysis of algorithms SL Randomized algorithm Connectivity NP-complete problems Graph coloring Theoretical computer science Computational complexity theory Applied mathematics
125	CPS296.2 Geometric Optimization February 22, 2007 Lecture 13: 1-Center, 1-Median problems Lecturer: Pankaj K. Agarwal Add to Reading List Source URL: www.cs.duke.edu Language: English - Date: 2007-04-05 11:46:26 Randomized algorithm Mathematics Computational geometry Coding theory Applied mathematics Finite fields Theoretical computer science Analysis of algorithms Probabilistic complexity theory
126	Space-Efficient Parallel Algorithms for Combinatorial Search Problems? A. Pietracaprina1 , G. Pucci1 , F. Silvestri1 , and F. Vandin2 1 University of Padova, Dip. Ingegneria dell’Informazione, Padova, Italy Add to Reading List Source URL: www.itu.dk Language: English - Date: 2015-01-07 05:01:30 Computational complexity theory Analysis of algorithms Tree traversal Tree B-tree Rope Time complexity Randomized algorithm Binary search tree Theoretical computer science Binary trees Graph theory
127	Randomized Loose Renaming in O(log log n) Time [Extended Abstract] ∗ † Add to Reading List Source URL: cs-www.cs.yale.edu Language: English - Date: 2015-04-30 10:34:00 Analysis of algorithms Probabilistic complexity theory Randomized algorithm Time complexity Algorithm Poisson distribution SL Theoretical computer science Computational complexity theory Applied mathematics
128	Tight Bounds for Asynchronous Renaming1 DAN ALISTARH, Microsoft Research Cambridge JAMES ASPNES2 , Yale KEREN CENSOR-HILLEL3 , Technion SETH GILBERT4 , National University of Singapore RACHID GUERRAOUI, EPFL Add to Reading List Source URL: cs-www.cs.yale.edu Language: English - Date: 2015-04-30 10:33:59 Analysis of algorithms Algorithm Time complexity Randomized algorithm Adversary model Consensus Distributed computing Complexity Quantum algorithm Theoretical computer science Applied mathematics Computational complexity theory
129	Randomized Distributed Decision Pierre Fraigniaud1 , Amos Korman1? , Merav Parter2 , and David Peleg2?? 1 CNRS and University Paris Diderot, France . {pierre.fraigniaud,amos.korman}@liafa.jussieu.fr Add to Reading List Source URL: www.liafa.jussieu.fr Language: English - Date: 2012-10-01 06:03:40 Randomized algorithm XTR Applied mathematics Mathematics Theoretical computer science Analysis of algorithms Probabilistic complexity theory
130	Exercise 1 (A streaming algorithm for counting the number of distinct values). [⋆] We are given a stream of numbers x1 , . . . , xn ∈ [m] and we want to compute the number of distinct values in the stream: F0 (x) = Add to Reading List Source URL: www.liafa.univ-paris-diderot.fr Language: English - Date: 2015-01-19 07:51:43 Analysis of algorithms Probabilistic complexity theory Randomized algorithm

UPDATE